On Subgraph Sizes in Random Graphs
نویسندگان
چکیده
منابع مشابه
On Subgraph Sizes in Random Graphs
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t : G contains a vertex-induced subgraph with t edges}. G has a full RSS if ρ(G) = {0, 1, . . . ,m}. We establish the threshold for a random graph to have a full RSS and give tight bounds on the likely RSS of a dense random graph. ∗Current Address: School of Mathematics, Georgia Institute of Technology, Atlanta GA30332 †Su...
متن کاملProperties of Random Graphs - Subgraph Containment
Random graphs are graphs with a fixed number of vertices, where each edge is present with a fixed probability. We are interested in the probability that a random graph contains a certain pattern, for example a cycle or a clique. A very high edge probability gives rise to perhaps too many edges (which degrades performance for many algorithms), whereas a low edge probability might result in a dis...
متن کاملMore on quasi-random graphs, subgraph counts and graph limits
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It has been shown by several authors that several such conditions are quasi-random, but that there are exceptions. In order to understand this better, we investig...
متن کاملModular Statistics for Subgraph Counts in Sparse Random Graphs
Answering a question of Kolaitis and Kopparty, we show that, for given integer q > 1 and pairwise nonisomorphic connected graphs G1, . . . , Gk, if p = p(n) is such that Pr(Gn,p ⊇ Gi) → 1 ∀i, then, with ξi the number of copies of Gi in Gn,p, (ξ1, . . . , ξk) is asymptotically uniformly distributed on Z k q .
متن کاملUpper Tails for Subgraph Counts in Random Graphs
Let G be a fixed graph and let XG be the number of copies of G contained in the random graph G(n, p). We prove exponential bounds on the upper tail of XG which are best possible up to a logarithmic factor in the exponent. Our argument relies on an extension of Alon’s result about the maximum number of copies of G in a graph with a given number of edges. Similar bounds are proved for the random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 1992
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548300000146